An efficient conditionally anonymous ring signature in the random oracle model
نویسندگان
چکیده
منابع مشابه
Lattice-Based Ring Signature Scheme under the Random Oracle Model
Abstract: On the basis of the signatures scheme without trapdoors from lattice, which is proposed by Vadim Lyubashevsky in 2012, we present a new ring signature scheme from lattice. The proposed ring signature scheme is an extension of the signatures scheme without trapdoors. We proved that our scheme is strongly unforgeable against adaptive chosen message in the random oracle model, and proved...
متن کاملConstant Size Ring Signature Without Random Oracle
Ring signature enables an user to anonymously sign a message on behalf of a group of users termed as ‘ring’ formed in an ‘ad-hoc’ manner. A naive scheme produces a signature linear in the size of the ring, but this is extremely inefficient when ring size is large. Dodis et al. proposed a constant size scheme in EUROCRYPT’13, but provably secure in random oracle model. Best known result without ...
متن کاملPrivacy-preserving Communication for VANETs with Conditionally Anonymous Ring Signature
In this paper, we introduce an efficient communication protocol for vehicular ad hoc networks (VANETs) based on conditionally anonymous ring signature scheme to address the issue on anonymous authentication and efficient tracking in case of a dispute. It offers low storage requirements and fast message authentication. In addition, the proposed protocol does not require Road-side Units to aid to...
متن کاملAn Efficient Identity-based Signature from Lattice in the Random Oracle Model
We propose an efficient identity-based signature (IBS) scheme. The security of our scheme is proved in the random oracle model. Core technical components of our constructions are built on an arborist extends its control for a lattice to an arbitrary higher-dimensional extension. We use lattice's growth and lattice basis randomization securely to generate the user's secret key, and use trapdoor ...
متن کاملThreshold Ring Signatures in the Random Oracle Model
We improve on the Bresson–Stern–Szydlo threshold ring signature scheme which uses Shamir secret sharing scheme [6] by showing that the security can be proved under a strictly weaker assumption, that is the random oracle model rather than the ideal cipher model. Then we propose an efficient (n− t)-out-of-n threshold ring signature scheme which is efficient when t is small compared with n. Our sc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2012
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2012.01.027